An Efficient Algorithm to Automated Discovery of Interesting Positive and Negative Association Rules
نویسندگان
چکیده
منابع مشابه
An Efficient Algorithm to Automated Discovery of Interesting Positive and Negative Association Rules
Association Rule mining is very efficient technique for finding strong relation between correlated data. The correlation of data gives meaning full extraction process. For the discovering frequent items and the mining of positive rules, a variety of algorithms are used such as Apriori algorithm and tree based algorithm. But these algorithms do not consider negation occurrence of the attribute i...
متن کاملAn efficient genetic algorithm for automated mining of both positive and negative quantitative association rules
In this paper, a genetic algorithm (GA) is proposed as a search strategy for not only positive but also negative quantitative association rule (AR) mining within databases. Contrary to the methods used as usual, ARs are directly mined without generating frequent itemsets. The proposed GA performs a database-independent approach that does not rely upon the minimum support and the minimum confide...
متن کاملAutomated Support Specification for Efficient Mining of Interesting Association Rules Automated Support Specification for Efficient Mining of Interesting Association Rules
In recent years, the weakness of the canonical support-confidence framework for associations mining has been widely studied. One of the difficulties in applying association rules mining is the setting of support constraints. A high-support constraint avoids the combinatorial explosion in discovering frequent itemsets, but at the expense of missing interesting patterns of low support. Instead of...
متن کاملAutomated support specification for efficient mining of interesting association rules
In recent years, the weakness of the canonical support-confidence framework for associations mining has been widely studied. One of the difficulties in applying association rules mining is the setting of support constraint. A high-support constraint avoids the combinatorial explosion in discovering frequent itemsets, but at the expense of missing interesting patterns of low support. Instead of ...
متن کاملOn the Discovery of Interesting Patterns in Association Rules
Many decision support systems, which utilize association rules for discovering interesting patterns, require the discovery of association rules that vary over time. Such rules describe complicated temporal patterns such as events that occur on the “first working day of every month.” In this paper, we study the problem of discovering how association rules vary over time. In particular, we introd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2015
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2015.060623